package org.hot100_2;

import org.leetcode.TreeNode;

public class leetcode104 {
    public int maxDepth(TreeNode root) {
        if (root==null){
            return 0;
        }

        int left = maxDepth(root.left);
        int right = maxDepth(root.right);

        return Math.max(left,right)+1;

    }
}
